Uncertainties in conditional probability tables of discrete Bayesian Belief Networks: A comprehensive review
نویسندگان
چکیده
منابع مشابه
On tensor rank of conditional probability tables in Bayesian networks
A difficult task in modeling with Bayesian networks is the elicitation of numerical parameters of Bayesian networks. A large number of parameters is needed to specify a conditional probability table (CPT) that has a larger parent set. In this paper we show that, most CPTs from real applications of Bayesian networks can actually be very well approximated by tables that require substantially less...
متن کاملUser Interface Tools for Navigation in Conditional Probability Tables and Elicitation of Probabilities in Bayesian Networks
Elicitation of probabilities is one of the most laborious tasks in building decision-theoretic models, and one that has so far received only moderate attention in decision-theoretic sys tems. We propose a set of user interface tools for graphical probabilistic models, fo cusing on two aspects of probability elici tation: (1) navigation through conditional probability tables and (2) interacti...
متن کاملSequential Updating Conditional Probability in Bayesian Networks by Posterior Probability
The Bayesian network is a powerful knowledge representation formalism; it is also capable of improving its precision through experience. Spiegelhalter et al. [1989] proposed a procedure for sequential updating forward conditional probabilities (FCP) in Bayesian networks of diameter 1 with a single parent node. The procedure assumes certainty for each diagnosis which is not practical for many ap...
متن کاملLearning Structured Bayesian Networks: Combining Abstraction Hierarchies and Tree-Structured Conditional Probability Tables
ion hierarchies are a commonly used form of knowledge that is intended to capture useful and meaningful groupings of feature values in a particular domain. An attributevalue hierarchy (AVH) is essentially an IS-A hierarchy for categorical feature values. The leaves of the AVH describe base-level values, and the interior nodes represent abstractions of base-level values. Each abstract value corr...
متن کاملApproximating discrete probability distributions with Bayesian networks
I generalise the arguments of [Chow & Liu 1968] to show that a Bayesian network satisfying some arbitrary constraint that best approximates a probability distribution is one for which mutual information weight is maximised. I give a practical procedure for finding an approximation network. The plan is first to discuss the approximation problem and its link with Bayesian network theory. After id...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Engineering Applications of Artificial Intelligence
سال: 2020
ISSN: 0952-1976
DOI: 10.1016/j.engappai.2019.103384